Computational number theory

Results: 224



#Item
71Cryptography / Lattice points / Linear algebra / Computational number theory / Lattice problem / Lattice / Lenstra–Lenstra–Lovász lattice basis reduction algorithm / Vector space / Algebra / Mathematics / Abstract algebra

Solving the Shortest Lattice Vector Problem in Time 22.465n Xavier Pujol1 and Damien Stehl´e2 1 Universit´e de Lyon, Laboratoire LIP, CNRS-ENSL-INRIA-UCBL, 46 All´ee d’Italie, 69364 Lyon Cedex 07, France 2

Add to Reading List

Source URL: eprint.iacr.org

Language: English - Date: 2010-02-08 02:45:52
72Group theory / Finite fields / Computational hardness assumptions / Logarithms / Discrete logarithm / Diffie–Hellman problem / Baby-step giant-step / Elliptic curve / Diffie–Hellman key exchange / Abstract algebra / Cryptography / Mathematics

Chapter 10 Number-Theoretic Primitives Number theory is a source of several computational problems that serve as primitives in the design of cryptographic schemes. Asymmetric cryptography in particular relies on these pr

Add to Reading List

Source URL: cseweb.ucsd.edu

Language: English - Date: 2009-09-20 23:35:30
73Neural networks / Neurophysiology / Computational neuroscience / Neurology / Synaptic plasticity / Hebbian theory / Synaptic weight / Long-term depression / Metaplasticity / Biology / Neuroscience / Nervous system

VOLUME 84, NUMBER 13 PHYSICAL REVIEW LETTERS 27 MARCH 2000

Add to Reading List

Source URL: www.itp.uni-bremen.de

Language: English - Date: 2011-08-10 05:51:03
74Integer factorization algorithms / Finite fields / Computational hardness assumptions / Algebraic number theory / Group theory / XTR / Discrete logarithm / Quadratic sieve / Integer factorization / Abstract algebra / Mathematics / Algebra

Security of Cryptosystems Based on Class Groups of Imaginary Quadratic Orders Safuat Hamdy Bodo Möller

Add to Reading List

Source URL: www.bmoeller.de

Language: English - Date: 2006-01-02 00:23:19
75Public-key cryptography / Diffie–Hellman key exchange / RSA / Mihir Bellare / XTR / SPEKE / Cryptography / Cryptographic protocols / Electronic commerce

COMPUTATIONAL NUMBER THEORY and ASYMMETRIC CRYPTOGRAPHY Mihir Bellare

Add to Reading List

Source URL: cseweb.ucsd.edu

Language: English - Date: 2015-05-03 20:58:58
76Cryptography / Lattice points / Computational number theory / Linear algebra / Lattice problem / Lattice / Normal distribution / Lenstra–Lenstra–Lovász lattice basis reduction algorithm / Vector space / Mathematics / Algebra / Abstract algebra

Improved Nguyen-Vidick Heuristic Sieve Algorithm for Shortest Vector Problem ? Xiaoyun Wang1,2 , Mingjie Liu1 , Chengliang Tian2 and Jingguo Bi2 1 Institute for Advanced Study, Tsinghua University, Beijing, China

Add to Reading List

Source URL: eprint.iacr.org

Language: English - Date: 2011-08-28 09:14:48
77Theoretical computer science / Randomness / Computational complexity theory / Philosophy of thermal and statistical physics / Min-entropy / Randomness extractor / Leftover hash lemma / Entropy / Random number generation / Information theory / Applied mathematics / Cryptography

REDEFINING RANDOMNESS QUANTIS WHEN RANDOM NUMBERS CANNOT BE LEFT TO CHANCE

Add to Reading List

Source URL: www.idquantique.com

Language: English - Date: 2015-03-23 10:17:13
78Algebra / Computational number theory / Graphics hardware / GPGPU / Cryptography / Lattice problem / Lattice reduction / Lenstra–Lenstra–Lovász lattice basis reduction algorithm / Lattice / Mathematics / Lattice points / Applied mathematics

Parallel Shortest Lattice Vector Enumeration on Graphics Cards? Jens Hermans ??1

Add to Reading List

Source URL: eprint.iacr.org

Language: English - Date: 2010-02-26 11:26:24
79Approximation algorithms / Cluster analysis / Combinatorial optimization / NP-complete problems / Complexity classes / Correlation clustering / Consensus clustering / Optimization problem / Minimum k-cut / Theoretical computer science / Computational complexity theory / Statistics

A Polynomial Time Approximation Scheme for k-Consensus Clustering∗ Tom Coleman† Abstract This paper introduces a polynomial time approximation scheme for the metric Correlation Clustering problem, when the number of

Add to Reading List

Source URL: tom.thesnail.org

Language: English - Date: 2015-05-04 03:09:24
80Scripting languages / Computational complexity theory / Cross-platform software / JavaScript / Generator / Fibonacci number / Quantum computer / Python / Informatics / Computing / Theoretical computer science / Software engineering

Errata and Addenda for “Informatics Everywhere” [7] Tom Verhoeff JuneErrata

Add to Reading List

Source URL: www.win.tue.nl

Language: English - Date: 2013-06-26 17:51:21
UPDATE